Canonical Decomposition of Polynomial Ideals
نویسندگان
چکیده
V.Ortiz established in [10] the existence of a canonical decomposition of ideals in a commutative noetherian ring. In this paper we study the canonical decomposition of ideals in a polynomial ring and we give an algorithmic procedure to compute canonical decompositions.
منابع مشابه
Commutative Ideal Theory without Finiteness Conditions: Primal Ideals
Our goal is to establish an efficient decomposition of an ideal A of a commutative ring R as an intersection of primal ideals. We prove the existence of a canonical primal decomposition: A = ⋂ P∈XA A(P ), where the A(P ) are isolated components of A that are primal ideals having distinct and incomparable adjoint primes P . For this purpose we define the set Ass(A) of associated primes of the id...
متن کاملIdeal Arithmetic and Infrastructure in Purely Cubic Function Fields Ideal Arithmetic and Infrastructure in Purely Cubic Function Fields
This paper investigates the arithmetic of fractional ideals and the infrastructure of the principal ideal class of a purely cubic function eld of unit rank one. We rst describe how irreducible polynomials split into prime ideals in purely cubic function elds of nonzero unit rank. This decomposition behavior is used to compute so-called canonical bases of fractional ideals; such bases are very s...
متن کاملA Polarization Operation for Pseudomonomial Ideals
Pseudomonomials and ideals generated by pseudomonomials (pseudomonomial ideals) are a central object of study in the theory of neural rings and neural codes. In the setting of a polynomial ring, we define the polarization operation ρ sending pseudomonomials to squarefree monomials and a further polarization operation P sending pseudomonomial ideals to squarefree monomial ideals. We show for a p...
متن کاملDetermination of a Matrix Function in the Form of f(A)=g(q(A)) Where g(x) Is a Transcendental Function and q(x) Is a Polynomial Function of Large Degree Using the Minimal Polynomial
Matrix functions are used in many areas of linear algebra and arise in numerical applications in science and engineering. In this paper, we introduce an effective approach for determining matrix function f(A)=g(q(A)) of a square matrix A, where q is a polynomial function from a degree of m and also function g can be a transcendental function. Computing a matrix function f(A) will be time- consu...
متن کاملComputational Theory of Polynomial Ideals
We provide methods to do explicit calculations in a polynomial ring in finitely many variables over a field. We develop algorithms to compute quotients of ideals, the radical of an ideal and a primary decomposition of an ideal. We also present methods to solve explicit tasks such as testing for prime ideals or identical ideals.
متن کامل